The Decomposition Algorithm for Skew-Symmetrizable Exchange Matrices
نویسندگان
چکیده
منابع مشابه
The Decomposition Algorithm for Skew-Symmetrizable Exchange Matrices
Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admit unfoldings to skew-symmetric matrices. We develop a combinatorial algorithm that determines if a given skew-symmetrizable matrix is of such type. This algorithm generalizes the one in [1]. As a corollary, we use this algorithm to determine ...
متن کاملMutation Classes of Skew-symmetrizable 3× 3 Matrices
Mutation of skew-symmetrizable matrices is a fundamental operation that first arose in Fomin-Zelevinsky’s theory of cluster algebras; it also appears naturally in many different areas of mathematics. In this paper, we study mutation classes of skew-symmetrizable 3 × 3 matrices and associated graphs. We determine representatives for these classes using a natural minimality condition, generalizin...
متن کاملCluster Automorphisms and the Marked Exchange Graphs of Skew-Symmetrizable Cluster Algebras
Cluster automorphisms have been shown to have links to the mapping class groups of surfaces, maximal green sequences and to exchange graph automorphisms for skew-symmetric cluster algebras. In this paper we generalise these results to the skew-symmetrizable case by introducing a marking on the exchange graph. Many skew-symmetrizable matrices unfold to skew-symmetric matrices and we consider how...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAlgorithms and Properties for Positive Symmetrizable Matrices
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating symmetrizable matrices with specific characteristics, called positive quasi-Cartan companion matrices. Here, symmetrizable matrix are those which are symmetric when m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2012
ISSN: 1077-8926
DOI: 10.37236/2447